Systematics on fission fragment mass distribution of neutron induced 235U fission

Based on the neutron induced fission fragment mass distribution data up to neutron energy 20 MeV measured with the double kinetic energy method (KEM) and the radio active method (RAM), the systematics of fission fragment mass distribution was investigated by using 5 Gaussian model and the systematics parameters were obtained by fitting the experimental data. With the systematics, the yields of any mass A and at any energy in the region from 0 to 20 MeV of neutron energy can be calculated. The calculated results could well reproduce the experimental data measured with KEM, but show some systematical deviation from the data measured by RAM, which reflects some systematical deviations between the two kinds of measured data.The error of systematics yield was calculated in an exact error transformation way, including from the error of the experimental yield data to the error of the discrete parameters, then to the systematics parameters,and at last to the yield calculated with systematics.     

Cohen–Macaulay Multi–Rees Algebras

Let A be a local ring, and let I ₁,...,I _r A be ideals of positive height. In this article we compare the Cohen–Macaulay property of the multi–Rees algebra R _A (I ₁,...,I _r ) to that of the usual Rees algebra R _A (I ₁ ··· I _r ) of the product I ₁ ··· I _r . In particular, when the analytic spread of I ₁ ··· I _r is small, this leads to necessary and sufficient conditions for the Cohen–Macaulayness of R _A (I ₁,...,I _r ). We apply our results to the theory of joint reductions and mixed multiplicities.     

An adaptive trust region method and its convergence

In this paper, a new trust region subproblem is proposed. The trust radius in the new subproblem adjusts itself adaptively. As a result, an adaptive trust region method is constructed based on the new trust region subproblem. The local and global convergence results of the adaptive trust region method are proved. Numerical results indicate that the new method is very efficient.     

The independence of initial vectors in the subdivision schemes

Starting with an initial vector λ = (λ(κ))κ∈z ∈ ep(Z), the subdivision scheme generates asequence (Snaλ)∞n=1 of vectors by the subdivision operator Saλ(κ) = ∑λ(j)a(k - 2j), k ∈ Z. j∈zSubdivision schemes play an important role in computer graphics and wavelet analysis. It is very interesting tounderstand under what conditions the sequence (Snaλ)∞n=1 converges to an Lp-function in an appropriate sense.This problem has been studied extensively. In this paper we show that the subdivision scheme converges forany initial vector in ep(Z) provided that it does for one nonzero vector in that space. Moreover, if the integertranslates of the refinable function are stable, the smoothness of the limit function corresponding to the vectorλ is also independent of λ.     

SUPPLEMENT TO “PASSAGE, BLOCKADE, SINK AND SOURCE OF A PLANAR DYNAMICAL SYSTEM”

A Theorem is given on the number of passages passing throgh a multiply-connected region,which corrects a wrong conjecture in a former paper of the author.     

The Bell inequalities and the joint measurement of incompatible observables

A quantum-mechanical theory of joint nonideal measurement of incompatible polarization observables is applied to an EPR-like experiment. It is demonstrated that this experiment yields both information satisfying and information violating the Bell inequalities. The measurement is also discussed in the context of a local hidden-variables theory. It is argued that the violation of an additional assumption of reproducibility of the hidden variable rather than violation of locality may be responsible for the violation of the Bell inequalities.     

Numerical experience with the truncated Newton method for unconstrained optimization

The truncated Newton algorithm was devised by Dembo and Steihaug (Ref. 1) for solving large sparse unconstrained optimization problems. When far from a minimum, an accurate solution to the Newton equations may not be justified. Dembo's method solves these equations by the conjugate direction method, but truncates the iteration when a required degree of accuracy has been obtained. We present favorable numerical results obtained with the algorithm and compare them with existing codes for large-scale optimization.     

A CLASS OF TRUST REGION METHODS FOR LINEAR INEQUALITY CONSTRAINED OPTIMIZATION AND ITS THEORY ANALYSIS Ⅱ. LOCAL CONVERGENCE RATE AND NUMERICAL TESTS

In this paper we prove that a class of trust region methods presented in part Ⅰ is superlinearly convergent. Numerical tests are reported thereafter. Results by solving a set of typical problems selected from literatures have demonstrated that our algorithm is effective.     

An optimum tolerance region for multivariate regression

A tolerance region is a map from the sample space of one statistical model to the event space of a second statistical model having the same parameter. This paper derives an optimum β-expectation tolerance region for the multivariate regression model. A measure of power is proposed and evaluated.